The BioGRID Interaction Database: 2011 update

The Biological General Repository for Interaction Datasets (BioGRID) is a public database that archives and disseminates genetic and protein interaction data from model organisms and humans (http://www.thebiogrid.org). BioGRID currently holds 347 966 interactions (170 162 genetic, 177 804 protein) curated from both high-throughput data sets and individual focused studies, as derived from over 23 000 publications in the primary literature. Complete coverage of the entire literature is maintained for budding yeast (Saccharomyces cerevisiae), fission yeast (Schizosaccharomyces pombe) and thale cress (Arabidopsis thaliana), and efforts to expand curation across multiple metazoan species are underway. The BioGRID houses 48 831 human protein interactions that have been curated from 10 247 publications. Current curation drives are focused on particular areas of biology to enable insights into conserved networks and pathways that are relevant to human health. The BioGRID 3.0 web interface contains new search and display features that enable rapid queries across multiple data types and sources. An automated Interaction Management System (IMS) is used to prioritize, coordinate and track curation across international sites and projects. BioGRID provides interaction data to several model organism databases, resources such as Entrez-Gene and other interaction meta-databases. The entire BioGRID 3.0 data collection may be downloaded in multiple file formats, including PSI MI XML. Source code for BioGRID 3.0 is freely available without any restrictions

Revisiting strategies for breeding anthracnose resistance in lentil: the case with wild species

Non-Peer ReviewedBreeders at the Crop Development Centre (CDC) have up to now only used germplasm resources available in the cultivated lentil to develop new varieties with resistance to diseases. Based on recent studies, the available cultivated germplasm does not offer sufficient genetic variation for resistance to anthracnose and ascochyta diseases. Lentil crop is attacked by two major diseases (anthracnose and ascochyta) that can cause 100% loss in the worst scenarios. Since anthracnose is only a major lentil disease in North America, no work has been done to improve resistance to this disease elsewhere. Wild species of many crops are known to carry many disease resistance genes lacking in the cultivated crop. We began the search for anthracnose resistance in the six wild species of lentil (world collection), of which two can be easily crossed with the cultivated type. Two strains of anthracnose (race 1 and race 2) with varying degrees of virulence were reported. The 2002 field data suggested that some of the Lens ervoides and Lens lamottei accessions exhibited no lesions at all when exposed to the combination of the two anthracnose strains. The cultivated types that show resistance to the less virulent strain were severely affected by anthracnose. In the greenhouse study the wild species were inoculated with the two strains separately and results indicate that no accession is immune to the more virulent type. However, some of the L. ervoides and L. lamottei accessions had good resistance compared to their cultivated counterparts. As a long term strategy, the lentil breeding program at CDC, University of Saskatchewan has a goal of fully utilizing the available resistance sources. However, these two species cannot be easily crossed with the cultivated types using the conventional/manual crossing techniques. A tissue culture procedure involving embryo rescue is used to facilitate crossing. We have been able to successfully rescue some embryos from crosses with Lens ervoides. The hybrid plants produce some fertile seeds which will be evaluated for resistance to both anthracnose and ascochyta. The selected resistant lines will then be backcrossed to the adopted backgrounds in order to deploy resistance genes

An ontology-based search engine for protein-protein interactions

<p>Abstract</p> <p>Background</p> <p>Keyword matching or ID matching is the most common searching method in a large database of protein-protein interactions. They are purely syntactic methods, and retrieve the records in the database that contain a keyword or ID specified in a query. Such syntactic search methods often retrieve too few search results or no results despite many potential matches present in the database.</p> <p>Results</p> <p>We have developed a new method for representing protein-protein interactions and the Gene Ontology (GO) using modified Gödel numbers. This representation is hidden from users but enables a search engine using the representation to efficiently search protein-protein interactions in a biologically meaningful way. Given a query protein with optional search conditions expressed in one or more GO terms, the search engine finds all the interaction partners of the query protein by unique prime factorization of the modified Gödel numbers representing the query protein and the search conditions.</p> <p>Conclusion</p> <p>Representing the biological relations of proteins and their GO annotations by modified Gödel numbers makes a search engine efficiently find all protein-protein interactions by prime factorization of the numbers. Keyword matching or ID matching search methods often miss the interactions involving a protein that has no explicit annotations matching the search condition, but our search engine retrieves such interactions as well if they satisfy the search condition with a more specific term in the ontology.</p

Modeling and verifying a broad array of network properties

Motivated by widely observed examples in nature, society and software, where groups of already related nodes arrive together and attach to an existing network, we consider network growth via sequential attachment of linked node groups, or graphlets. We analyze the simplest case, attachment of the three node V-graphlet, where, with probability alpha, we attach a peripheral node of the graphlet, and with probability (1-alpha), we attach the central node. Our analytical results and simulations show that tuning alpha produces a wide range in degree distribution and degree assortativity, achieving assortativity values that capture a diverse set of many real-world systems. We introduce a fifteen-dimensional attribute vector derived from seven well-known network properties, which enables comprehensive comparison between any two networks. Principal Component Analysis (PCA) of this attribute vector space shows a significantly larger coverage potential of real-world network properties by a simple extension of the above model when compared against a classic model of network growth.Comment: To appear in Europhysics Letter

MCL-CAw: A refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure

Abstract Background The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of the cell. Over the past few years, several independent high-throughput experiments have helped to catalogue enormous amount of physical protein interaction data from organisms such as yeast. However, these individual datasets show lack of correlation with each other and also contain substantial number of false positives (noise). Over these years, several affinity scoring schemes have also been devised to improve the qualities of these datasets. Therefore, the challenge now is to detect meaningful as well as novel complexes from protein interaction (PPI) networks derived by combining datasets from multiple sources and by making use of these affinity scoring schemes. In the attempt towards tackling this challenge, the Markov Clustering algorithm (MCL) has proved to be a popular and reasonably successful method, mainly due to its scalability, robustness, and ability to work on scored (weighted) networks. However, MCL produces many noisy clusters, which either do not match known complexes or have additional proteins that reduce the accuracies of correctly predicted complexes. Results Inspired by recent experimental observations by Gavin and colleagues on the modularity structure in yeast complexes and the distinctive properties of "core" and "attachment" proteins, we develop a core-attachment based refinement method coupled to MCL for reconstruction of yeast complexes from scored (weighted) PPI networks. We combine physical interactions from two recent "pull-down" experiments to generate an unscored PPI network. We then score this network using available affinity scoring schemes to generate multiple scored PPI networks. The evaluation of our method (called MCL-CAw) on these networks shows that: (i) MCL-CAw derives larger number of yeast complexes and with better accuracies than MCL, particularly in the presence of natural noise; (ii) Affinity scoring can effectively reduce the impact of noise on MCL-CAw and thereby improve the quality (precision and recall) of its predicted complexes; (iii) MCL-CAw responds well to most available scoring schemes. We discuss several instances where MCL-CAw was successful in deriving meaningful complexes, and where it missed a few proteins or whole complexes due to affinity scoring of the networks. We compare MCL-CAw with several recent complex detection algorithms on unscored and scored networks, and assess the relative performance of the algorithms on these networks. Further, we study the impact of augmenting physical datasets with computationally inferred interactions for complex detection. Finally, we analyse the essentiality of proteins within predicted complexes to understand a possible correlation between protein essentiality and their ability to form complexes. Conclusions We demonstrate that core-attachment based refinement in MCL-CAw improves the predictions of MCL on yeast PPI networks. We show that affinity scoring improves the performance of MCL-CAw.http://deepblue.lib.umich.edu/bitstream/2027.42/78256/1/1471-2105-11-504.xmlhttp://deepblue.lib.umich.edu/bitstream/2027.42/78256/2/1471-2105-11-504-S1.PDFhttp://deepblue.lib.umich.edu/bitstream/2027.42/78256/3/1471-2105-11-504-S2.ZIPhttp://deepblue.lib.umich.edu/bitstream/2027.42/78256/4/1471-2105-11-504.pdfPeer Reviewe

First steps towards a fast-neutron therapy planning program

<p>Abstract</p> <p>Background</p> <p>The Monte Carlo code GEANT4 was used to implement first steps towards a treatment planning program for fast-neutron therapy at the FRM II research reactor in Garching, Germany. Depth dose curves were calculated inside a water phantom using measured primary neutron and simulated primary photon spectra and compared with depth dose curves measured earlier. The calculations were performed with GEANT4 in two different ways, simulating a simple box geometry and splitting this box into millions of small voxels (this was done to validate the voxelisation procedure that was also used to voxelise the human body).</p> <p>Results</p> <p>In both cases, the dose distributions were very similar to those measured in the water phantom, up to a depth of 30 cm. In order to model the situation of patients treated at the FRM II MEDAPP therapy beamline for salivary gland tumors, a human voxel phantom was implemented in GEANT4 and irradiated with the implemented MEDAPP neutron and photon spectra. The 3D dose distribution calculated inside the head of the phantom was similar to the depth dose curves in the water phantom, with some differences that are explained by differences in elementary composition. The lateral dose distribution was studied at various depths. The calculated cumulative dose volume histograms for the voxel phantom show the exposure of organs at risk surrounding the tumor.</p> <p>Conclusions</p> <p>In order to minimize the dose to healthy tissue, a conformal treatment is necessary. This can only be accomplished with the help of an advanced treatment planning system like the one developed here. Although all calculations were done for absorbed dose only, any biological dose weighting can be implemented easily, to take into account the increased radiobiological effectiveness of neutrons compared to photons.</p

Protein–Protein Interactions Essentials: Key Concepts to Building and Analyzing Interactome Networks

8 páginas, 3 figuras, 1 tabla.-- This is an open-access article distributed under the terms of the Creative Commons Attribution License.This work has been supported by funds provided by the Local Government Junta de Castilla y León (JCyL, ref. project: CSI07A09), by the Spanish Ministry of Science and Innovation (MICINN - ISCiii, ref. projects: PI061153 and PS09/00843) and by the European Commission Research Grant PSIMEx (ref. FP7-HEALTH-2007-223411).Peer Reviewe

A systematic analysis of host factors reveals a Med23-interferon-λ regulatory axis against herpes simplex virus type 1 replication

Herpes simplex virus type 1 (HSV-1) is a neurotropic virus causing vesicular oral or genital skin lesions, meningitis and other diseases particularly harmful in immunocompromised individuals. To comprehensively investigate the complex interaction between HSV-1 and its host we combined two genome-scale screens for host factors (HFs) involved in virus replication. A yeast two-hybrid screen for protein interactions and a RNA interference (RNAi) screen with a druggable genome small interfering RNA (siRNA) library confirmed existing and identified novel HFs which functionally influence HSV-1 infection. Bioinformatic analyses found the 358 HFs were enriched for several pathways and multi-protein complexes. Of particular interest was the identification of Med23 as a strongly anti-viral component of the largely pro-viral Mediator complex, which links specific transcription factors to RNA polymerase II. The anti-viral effect of Med23 on HSV-1 replication was confirmed in gain-of-function gene overexpression experiments, and this inhibitory effect was specific to HSV-1, as a range of other viruses including Vaccinia virus and Semliki Forest virus were unaffected by Med23 depletion. We found Med23 significantly upregulated expression of the type III interferon family (IFN-λ) at the mRNA and protein level by directly interacting with the transcription factor IRF7. The synergistic effect of Med23 and IRF7 on IFN-λ induction suggests this is the major transcription factor for IFN-λ expression. Genotypic analysis of patients suffering recurrent orofacial HSV-1 outbreaks, previously shown to be deficient in IFN-λ secretion, found a significant correlation with a single nucleotide polymorphism in the IFN-λ3 (IL28b) promoter strongly linked to Hepatitis C disease and treatment outcome. This paper describes a link between Med23 and IFN-λ, provides evidence for the crucial role of IFN-λ in HSV-1 immune control, and highlights the power of integrative genome-scale approaches to identify HFs critical for disease progression and outcome

Exploratory analysis of protein translation regulatory networks using hierarchical random graphs

Abstract Background Protein translation is a vital cellular process for any living organism. The availability of interaction databases provides an opportunity for researchers to exploit the immense amount of data in silico such as studying biological networks. There has been an extensive effort using computational methods in deciphering the transcriptional regulatory networks. However, research on translation regulatory networks has caught little attention in the bioinformatics and computational biology community. Results In this paper, we present an exploratory analysis of yeast protein translation regulatory networks using hierarchical random graphs. We derive a protein translation regulatory network from a protein-protein interaction dataset. Using a hierarchical random graph model, we show that the network exhibits well organized hierarchical structure. In addition, we apply this technique to predict missing links in the network. Conclusions The hierarchical random graph mode can be a potentially useful technique for inferring hierarchical structure from network data and predicting missing links in partly known networks. The results from the reconstructed protein translation regulatory networks have potential implications for better understanding mechanisms of translational control from a system’s perspective